Aggregates in Possibilistic Databases

نویسندگان

  • Elke A. Rundensteiner
  • Lubomir F. Bic
چکیده

Fuzzy set theory represents a uniform framework for extending the relational database model to han-, dle imprecision of information found in the real world. None of the existing proposals for data models handling imprecision has dealt with queries involvin aggregate operators. This paper presents a framewor for ek handling aggregates in the context of imprecise information. Two kinds of aggregates, namely, scalar aggregates and aggregate functions, are being supported. We consider three cases: aggregates within approximate queries on precise data, aggregates within precisely specified queries on possibilistic data, and aggregates within vague queries on imprecise data. These extensions are based on fuzzy set-theoretical concepts such as the extension principle and the possibilistic expected value.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

About Cardinality-based Possibilistic Queries against Possibilistic Databases

This paper deals with the querying of possibilistic relational databases, by means of possibilistic queries whose general form is: "to what extent is it possible that the answer to Q satisfies property P". Here, we consider cardinality-based queries (in this case, property P is about cardinality) for which a processing technique is proposed, which avoids computing all the worlds attached to the...

متن کامل

Evaluating aggregates in possibilistic relational databases

The need for extending information management systems to handle the imprecision of information found in the real world has been recognized. Fuzzy set theory together with possibility theory represent a uniform framework for extending the relational database model with these features. However, none of the existing proposals for handling imprecision in the literature has dealt with queries involv...

متن کامل

Possibilistic and Extended Logic Programs

Based on our earlier work on partial logics and extended logic programs Wag91, Wag94, HJW96], and on the possibilistic logic of DLP94], we deene a compositional possibilistic rst-order logic with two kinds of negation as the logical basis of semi-possibilistic and possibilis-tic logic programs. We show that in the same way as the minimal model semantics of relational databases can be reened to ...

متن کامل

Efficient Query Computing for Uncertain Possibilistic Databases with Provenance

We propose an extension of possibilistic databases that also includes provenance. The introduction of provenance makes our model closed under selection with equalities, projection and join. In addition the computation of query computing with possibilities is polynomial, in contrast with current models that combine provenance with probabilities and have#P complexity.

متن کامل

Possibilistic Modeling of Iris System for High Recognition Reliability

†University of Sfax, National Engineering School of Sfax, Control and Energy Management Laboratory, Sfax, BPW 30308, Tunisia Summary The human iris is attracting a lot of attention leading to an increased demand for a robust and reliable iris-based recognition system. However, typical systems have random performances which can be efficient for some contexts and not for others. Generally, in rea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989